package org.example.yuewen.solution20;

/**
 * @author: lynn
 * @Descript: 判断素数
 * @date: 2021/3/31 23:09
 * @version: 1.0
 */
public class PrimeNumber {
    public static void main(String[] args) {

    }

    private static boolean isPrimeNum(int n){

        if (n<=1){
            return false;
        }
        for (int i = 2; i < n ; i++) {
            if (n%i==0){
                return true;
            }
        }
        return false;
    }
}
